Geometric properties of graph layouts optimized for greedy navigation

The graph layouts used for complex network studies have been mainly developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable cue for various purposes. In this work, we focus on encoding useful navigational information to geometric coordinates of vertices of spatial graphs, which is a reverse problem of harnessing geometric information for better navigation. In other words, the coordinates of the vertices are a map of the topology, not the other way around. We use a recently developed user-centric navigation protocol to explore spatial layouts of complex networks that are optimal for navigation. These layouts are generated with a simple simulated annealing optimization technique. We compare these layouts to others targeted at better visualization and discuss the spatial statistical properties of the optimized layouts for better navigability and its implication.